2 1 O ct 2 00 1 An algorithm to generate exactly once every tiling with lozenges of a domain ∗
نویسنده
چکیده
We first show that the tilings of a domain D form a lattice (using the same kind of arguments as in [Rém99]) which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We show that general domains can be broken up into hexagon-like parts. Finally we give an algorithm to generate exactly once every element in the lattice of the tilings of a general domain D.
منابع مشابه
An algorithm to generate exactly once every tiling with lozenges of a domain
We first show that the tilings of a domain D form a lattice (using the same kind of arguments as in [Rém99]) which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We show that general domains can be broken up into hexagon-like parts. Finally we give an algorithm to generate exact...
متن کاملO ct 2 00 1 On the existence of completely saturated packings and completely reduced coverings
We prove the following conjecture of G. Fejes Toth, G. Kuperberg, and W. Kuperberg: every body K in either n-dimensional Euclidean or n-dimensional hyperbolic space admits a completely saturated packing and a completely reduced covering. Also we prove the following counterintuitive result: for every ǫ > 0, there is a body K in hyperbolic n-space which admits a completely saturated packing with ...
متن کاملBalanced Islands in Two Colored Point Sets in the Plane
Let P be a set of n points in general position in the plane, r of which are red and b of which are blue. In this paper we prove that there exist: for every α ∈ [ 0, 1 2 ] , a convex set containing exactly dαre red points and exactly dαbe blue points of P ; a convex set containing exactly ⌈ r+1 2 ⌉ red points and exactly ⌈ b+1 2 ⌉ blue points of P . Furthermore, we present polynomial time algori...
متن کاملm at h . C O / 0 20 52 06 v 1 1 9 M ay 2 00 2 132 - avoiding Two - stack Sortable Permutations , Fibonacci Numbers , and Pell Numbers ∗
In [W2] West conjectured that there are 2(3n)!/((n+1)!(2n+1)!) two-stack sortable permutations on n letters. This conjecture was proved analytically by Zeilberger in [Z]. Later, Dulucq, Gire, and Guibert [DGG] gave a combinatorial proof of this conjecture. In the present paper we study generating functions for the number of two-stack sortable permutations on n letters avoiding (or containing ex...
متن کاملSimplifying Polynomial Constraints over Integers to Make Dependence Analysis More Precise Simplifying Polynomial Constraints over Integers to Make Dependence Analysis More Precise
Why do existing parallelizing compilers and environments fail to parallelize many realistic FORTRAN programs? One of the reasons is that these programs contain a number of linearized array references, such as A(M*N*i+N*j+k) or A(i*(i+1)/2+j). Performing exact dependence analysis for these references requires testing polynomial constraints for integer solutions. Most existing dependence analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008